Progressive Secret Sharing with Adaptive Priority and Perfect Reconstruction

Perfect Privacy for Webmail with Secret Sharing

With the many advantages of web-based mail comes a very serious privacy flaw – all messages are stored in a single central location on the webmail operator’s data center. This fact makes these data centers a natural interception point for various undesirable parties, severely risking the privacy of individual webmail users. We propose a novel and unique way to solve this problem and protect the...

Perfect Secret Sharing Schemes from

Secret sharing schemes are one of the most important primitives in distributed systems. In perfect secret sharing schemes, collaboration between unauthorised participants cannot reduce their uncertainty about the secret. This paper presents a perfect secret sharing scheme arising from critical sets of Room squares.

Secret Sharing and Perfect Zero Knowledge

On Secret Sharing with Nonlinear Product Reconstruction

Multiplicative linear secret sharing is a fundamental notion in the area of secure multiparty computation (MPC) and, since recently, in the area of two-party cryptography as well. In a nutshell, this notion guarantees that “the product of two secrets is obtained as a linear function of the vector consisting of the coordinate-wise product of two respective share-vectors”. This paper focuses on t...

Chor : Secret Sharing with Public Reconstruction

| All known constructions of information theo-retic tout of -n secret sharing schemes require secure, private communication channels among the parties for the reconstruction of the secret. In this work we investigate the cost of performing the reconstruction over public communication channels. A naive implementation of this task distributes 2n ? 2 one times pads to each party. This results in s...